Improving Bit-Vector Representation of Points-To Sets Using Class Hierarchy
نویسندگان
چکیده
منابع مشابه
Improving bit-vector representation of points-to sets using class hierarchy
Points-to analysis is the problem of approximating run-time values of pointers statically or at compile-time. Pointsto sets are used to store the approximated values of pointers during points-to analysis. Memory usage and running time limit the ability of points-to analysis to analyze large programs. To our knowledge, works which have implemented a bit-vector representation of points-to sets so...
متن کاملImproving Classification When a Class Hierarchy is Available Using a Hierarchy-Based Prior
We introduce a new method for building classification models when we have prior knowledge of how the classes can be arranged in a hierarchy, based on how easily they can be distinguished. The new method uses a Bayesian form of the multinomial logit (MNL, a.k.a. “softmax”) model, with a prior that introduces correlations between the parameters for classes that are nearby in the tree. We compare ...
متن کاملImproving Classification Models When a Class Hierarchy Is Available
Improving classification models when a class hierarchy is available Babak Shahbaba Doctor of Philosophy Graduate Department of Public Health Sciences University of Toronto 2007 We introduce a new method for modeling hierarchical classes, when we have prior knowledge of how these classes can be arranged in a hierarchy. The application of this approach is discussed for linear models, as well as n...
متن کاملRegistering sets of points using Bayesian regression
This work addresses the problem of non-rigid registration between two 2D or 3D points sets as a novel application of Relevance Vector Machines (RVM). An iterative framework is proposed which consists of two steps: at first, correspondences between distinct points are estimated by the Hungarian algorithm and then a regression procedure based on a Bayesian linear model (RVM) maps the two sets of ...
متن کاملBit-Vector Model Counting using Statistical Estimation
Approximate model counting for bit-vector SMT formulas (generalizing #SAT) has many applications such as probabilistic inference and quantitative information-flow security, but it is computationally difficult. Adding random parity constraints (XOR streamlining) and then checking satisfiability is an effective approximation technique, but it requires a prior hypothesis about the model count to p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Theory and Engineering
سال: 2013
ISSN: 1793-8201
DOI: 10.7763/ijcte.2013.v5.436